By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 5, Issue 1, pp. 1-180

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Sorting and Searching in Multisets

Ian Munro and Philip M. Spira

pp. 1-8

BibTeX  Abstract Full Text:  PDF

Optimal Alphabetic Trees

Alon Itai

pp. 9-18

BibTeX  Abstract Full Text:  PDF

Partial-Match Retrieval Algorithms

Ronald L. Rivest

pp. 19-50

BibTeX  Abstract Full Text:  PDF

Machine Selection of Elements in Crossword Puzzles: An Application of Computational Linguistics

Lawrence J. Mazlack

pp. 51-72

BibTeX  Abstract Full Text:  PDF

Scheduling Graphs on Two Processors

Ravi Sethi

pp. 73-82

BibTeX  Abstract Full Text:  PDF

New Bounds on the Complexity of the Shortest Path Problem

Michael L. Fredman

pp. 83-89

BibTeX  Abstract Full Text:  PDF

On Algorithms for Enumerating All Circuits of a Graph

Prabhaker Mateti and Narsingh Deo

pp. 90-99

BibTeX  Abstract Full Text:  PDF

On the Evaluation of Powers

Andrew Chi-Chih Yao

pp. 100-103

BibTeX  Abstract Full Text:  PDF

$b$-Matchings in Trees

S. Goodman, S. Hedetniemi, and R. E. Tarjan

pp. 104-108

BibTeX  Abstract Full Text:  PDF

Bounds for Selection

Laurent Hyafil

pp. 109-114

BibTeX  Abstract Full Text:  PDF

On Finding Lowest Common Ancestors in Trees

A. V. Aho, J. E. Hopcroft, and J. D. Ullman

pp. 115-132

BibTeX  Abstract Full Text:  PDF

A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph

Tatsuo Ohtsuki

pp. 133-145

BibTeX  Abstract Full Text:  PDF

On the Number of Additions to Compute Specific Polynomials

Allan Borodin and Stephen Cook

pp. 146-157

BibTeX  Abstract Full Text:  PDF

A Comparison of Two Algorithms for Global Data Flow Analysis

Ken Kennedy

pp. 158-180

BibTeX  Abstract Full Text:  PDF